High-Order Random Walks and Generalized Laplacians on Hypergraphs
نویسندگان
چکیده
منابع مشابه
High-Ordered Random Walks and Generalized Laplacians on Hypergraphs
Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...
متن کاملThe cover times of random walks on random uniform hypergraphs
Random walks in graphs have been applied to various network exploration and network maintenance problems. In some applications, however, it may be more natural, and more accurate, to model the underlying network not as a graph but as a hypergraph, and solutions based on random walks require a notion of random walks in hypergraphs. At each step, a random walk on a hypergraph moves from its curre...
متن کاملIntrinsic random walks and sub-Laplacians in sub-Riemannian geometry
On a sub-Riemannian manifold we define two type of Laplacians. The macroscopic Laplacian ∆ω, as the divergence of the horizontal gradient, once a volume ω is fixed, and the microscopic Laplacian, as the operator associated with a sequence of geodesic random walks. We consider a general class of random walks, where all sub-Riemannian geodesics are taken in account. This operator depends only on ...
متن کاملGeneralized Laplacian Eigenvalues of Random Hypergraphs
This is a sequel to an accepted talk of WAW 2011, where we introduced a set of generalized Laplacians of hypergraphs through the high-ordered random walks. In that paper, we proved the eigenvalues of these Laplacians can effectively control the mixing rate of highordered random walks, the generalized distances/diameters, and the edge expansions. In this talk, we will give a preliminary report o...
متن کاملThe Cover Times of Random Walks on Hypergraphs
Random walks in graphs have been applied to various network exploration and networkmaintenance problems. In some applications, however, it may be more natural, and moreaccurate, to model the underlying network not as a graph but as a hypergraph, and solutionsbased on random walks require a notion of random walks in hypergraphs. While randomwalks in graphs have been extensive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2013
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2012.678151